CoStLy: A Validated Library for Complex Functions
نویسندگان
چکیده
منابع مشابه
CoStLy: A Validated Library for Complex Functions
For the validated computation of complex functions, Bühler [1] has implemented algorithms that were presented in [2] as part of a Pascal–XSC interval library. Although Pascal-XSC is still available [4], it is no longer being maintained and it requires outdated compiler versions, which make it difficult to use nowadays. CoStLy is a new C++ library of complex standard functions for the rigorous c...
متن کاملThe CoStLy C++ Class Library
where power(z, n) is the power function for integer exponents, pow(z, p) is the power function for real or complex exponents, and root(z, n) denotes the nth root function. An interval library for the real standard functions in SF is required by CoStLy, for evaluating the compositions of real functions that make up the real and imaginary parts of the complex functions in SF . CoStLy has been pro...
متن کاملValidated Special Functions Software
Because of the importance of special functions, several books and a large collection of papers have been devoted to the numerical computation of these functions, the most well-known being the NBS handbook by Abramowitz and Stegun. But up to this date, symbolic and numeric environments offer no routines for the validated evaluation of special functions. We point out how a provable correct functi...
متن کاملTensor Product Grid Generation for Complex Surface Visualizations in a Digital Library of Mathematical Functions
We have used tensor product B-spline grids to develop accurate plots that enhance the understanding of high level mathematical functions described in the National Institute of Standards and Technology Digital Library of Mathematical Functions. The graph data is placed in a web based format such as VRML (Virtual Reality Modeling Language) or X3D (Extensible 3D) to provide an environment where us...
متن کاملGlint: An MDS Framework for Costly Distance Functions
Previous algorithms for multidimensional scaling, or MDS, aim for scalable performance as the number of points to lay out increases. However, they either assume that the distance function is cheap to compute, and perform poorly when the distance function is costly, or they leave the precise number of distances to compute as a manual tuning parameter. We present Glint, an MDS algorithm framework...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PAMM
سال: 2004
ISSN: 1617-7061,1617-7061
DOI: 10.1002/pamm.200410278